Partitioned neighborhood spanners of minimal outdegree
نویسندگان
چکیده
A geometric spanner with vertex set P IRD is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k 2 IN and the stretch factor f > 1 describing the ‘quality’ of the approximation. PNGs have been throughly investigated with respect to small values of f . We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations: a) k determines the amount of space required for storing PNGs. b) Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree. Our results include, for fixed dimensions D as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases. 1Partially supported by EU ESPRIT Long Term Research Project 20244 (ALCOM-IT) and DFG Grants Me872/7-1 and Me872/4-1
منابع مشابه
Partitioned Neighborhood Spanners of Minimal Outdegree1
A geometric spanner with vertex set P IRD is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k 2 IN and the stretch factor f > 1 describing the ‘qualit...
متن کاملNeighborhood Spanners of Minimal Outdegree 1
A geometric spanner with vertex set P IRD is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k 2 IN and the stretch factor f > 1 describing the ‘qualit...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملVertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebitz
It was proved Bessy et al., 2010 that for r ≥ 1, a tournament with minimum semidegree at least 2r − 1 contains at least r vertex-disjoint directed triangles. It was also proved Lichiardopol, 2010 that for integers q ≥ 3 and r ≥ 1, every tournament with minimum semidegree at least q − 1 r − 1 contains at least r vertex-disjoint directed cycles of length q. None information was given on these dir...
متن کاملSome Properties of Yao Y4 Subgraphs
The Yao graph for k = 4, Y4, is naturally partitioned into four subgraphs, one per quadrant. We show that the subgraphs for one quadrant differ from the subgraphs for two adjacent quadrants in three properties: planarity, connectedness, and whether the directed graphs are spanners.
متن کامل